Predicting the Winner in Two Player StarCraft Games

نویسنده

  • Antonio A. Sánchez-Ruiz-Granados
چکیده

In this paper we compare different machine learning algorithms to predict the outcome of 2 player games in StarCraft, a wellknown Real-Time Strategy (RTS) game. In particular we discuss the game state representation, the accuracy of the prediction as the game progresses, the size of the training set and the stability of the predictions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks

Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...

متن کامل

Identifying Players and Predicting Actions from RTS Game Replays

This paper investigates the problem of identifying a Real-Time Strategy game player and predicting what a player will do next based on previous actions in the game. Being able to recognize a player’s playing style and their strategies helps us learn the strengths and weaknesses of a specific player, devise counter-strategies that beat the player, and eventually helps us to build better game AI....

متن کامل

Mining Replays of Real-Time Strategy Games to Learn Player Strategies

Developing computer-controlled groups to engage in combat, control the use of limited resources, and create units and buildings in Real-Time Strategy(RTS) Games is a novel application in game AI. However, a controlled and closed console commercial game environment pose challenges to researchers interested in observing player activities, constructing player strategy models, and developing practi...

متن کامل

Reachability Switching Games

In this paper, we study the problem of deciding the winner of reachability switching games. These games provide deterministic analogues of Markovian systems. We study zero-, one-, and two-player variants of these games. We show that the zero-player case is NL-hard, the one-player case is NP-complete, and that the two-player case is PSPACE-hard and in EXPTIME. In the oneand two-player cases, the...

متن کامل

Real-Time Strategy Game Competitions

106 AI MAGAZINE RTS games — such as StarCraft by Blizzard Entertainment and Command and Conquer by Electronic Arts — are popular video games that can be described as real-time war simulations in which players delegate units under their command to gather resources, build structures, combat and support units, scout opponent locations, and attack. The winner of an RTS game usually is the player or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015